منابع مشابه
Future - Sequential Regularization Methods
We develop a theoretical context in which to study the future-sequential regularization method developed by J. V. Beck for the Inverse Heat Conduction Problem. In the process, we generalize Beck's ideas and view that method as one in a large class of regularization methods in which the solution of an ill-posed rst-kind Volterra equation is seen to be the limit of a sequence of solutions of well...
متن کاملRegularization Methods for Differential
Many mathematical models arising in science and engineering, including circuit and device simulation in VLSI, constrained mechanical systems in robotics and vehicle simulation, certain models in early vision and incompressible uid ow, lead to computationally challenging problems of di erential equations with constraints, and more particularly to high-index, semi-explicit di erential-algebraic e...
متن کاملArnoldi-Tikhonov regularization methods
Tikhonov regularization for large-scale linear ill-posed problems is commonly implemented by determining a partial Lanczos bidiagonalization of the matrix of the given system of equations. This paper explores the possibility of instead computing a partial Arnoldi decomposition of the given matrix. Computed examples illustrate that this approach may require fewer matrix-vector product evaluation...
متن کاملRegularization Methods for Semidefinite Programming
We introduce a new class of algorithms for solving linear semidefinite programming (SDP) problems. Our approach is based on classical tools from convex optimization such as quadratic regularization and augmented Lagrangian techniques. We study the theoretical properties and we show that practical implementations behave very well on some instances of SDP having a large number of constraints. We ...
متن کاملRegularization Methods for Additive Models
This paper tackles the problem of model complexity in the context of additive models. Several methods have been proposed to estimate smoothing parameters, as well as to perform variable selection. Nevertheless, these procedures are inefficient or computationally expensive in high dimension. Also, the lasso technique has been adapted to additive models, however its experimental performance has n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2009
ISSN: 0377-0427
DOI: 10.1016/j.cam.2008.05.003